Solving a two-facility location problem in a space with Chebyshev metric

نویسندگان

چکیده

A minimax two-facility location problem in multidimensional space with Chebyshev metric is examined subject to box constraints on the feasible area. In problem, there are two groups of points known coordinates, and one needs find coordinates for optimal new under given constraints. The considered if it minimizes maximum following values: distance between first point farthest group, second points. formulated as a optimization terms tropical mathematics that studies theory applications algebraic systems idempotent operations. direct analytical solution derived based use methods results optimization. result obtained which describes set parametric form ready formal analysis solutions straightforward calculation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Competitive Facility Location Problem in a Discrete Planar Space

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...

متن کامل

Squared Metric Facility Location Problem

Jain et al. proposed two well-known algorithms for the Metric Facility Location Problem (MFLP), that achieve approximation ratios of 1.861 and 1.61. Mahdian et al. combined the latter algorithm with scaling and greedy augmentation techniques, obtaining a 1.52-approximation for the MFLP. We consider a generalization of the Squared Euclidean Facility Location Problem, when the distance function i...

متن کامل

A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier

This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...

متن کامل

Uncapacitated Metric Facility Location Problem (umfl)

• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an ass...

متن کامل

Solving Facility Location Problem on Cluster Computing

Computation of facility location problem for every location in the country is not easy simultaneously. Solving the problem is described by using cluster computing. A technique is to design parallel algorithm by using local search with single swap method in order to solve that problem on clusters. Parallel implementation is done by the use of portable parallel programming, Message Passing Interf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ??????? ?????-?????????????? ????????????

سال: 2022

ISSN: ['1811-9905', '2542-2251']

DOI: https://doi.org/10.21638/spbu01.2022.405